منابع مشابه
Neighborhood Complexes of Some Exponential Graphs
In this article, we consider the bipartite graphs K2 × Kn. We first show that the connectedness of N (Kn n+1) = 0. Further, we show that Hom(K2 ×Kn,Km) is homotopic to Sm−2, if 2 6 m < n.
متن کاملGraphs of Some CAT(0) Complexes
In this note, we characterize the graphs (1-skeletons) of some piecewise Euclidean simplicial and cubical complexes having nonpositive curvature in the sense of Gromov’s CAT(0) inequality. Each such cell complex K is simply connected and obeys a certain flag condition. It turns out that if, in addition, all maximal cells are either regular Euclidean cubes or right Euclidean triangles glued in a...
متن کاملsynthesis and characterization of some new cyclometalated organoplatinum(ii) complexes containing phosphite ligand
در این تحقیق روشی جهت سنتز یک سری از کمپلکس های پلاتین (ii) حاوی لیگاند های دهنده ی فسفری شامل فسفیت و فسفین ارائه شده است. واکنش پیش ماده ی پلاتین (ii)،trans/cis- [ptcl2(sme2)2] ، با 2 اکی مولار از لیگاند p(oph)3در حلال بنزن کمپلکس1، cis-[ptcl2(p(oph)3)2] را تولید می نماید. جهت سنتز کمپلکس سایکلو متال فسفیتی، کمپلکس 1 با 1 اکی والان واکنشگر ptcl2 در حلال زایلن در شرایط رفلاکس زیر گاز آرگون م...
SOLVABILITY OF FREE PRODUCTS, CAYLEY GRAPHS AND COMPLEXES
In this paper, we verify the solvability of free product of finite cyclic groups with topological methods. We use Cayley graphs and Everitt methods to construct suitable 2-complexes corresponding to the presentations of groups and their commutator subgroups. In particular, using these methods, we prove that the commutator subgroup of $mathbb{Z}_{m}*mathbb{Z}_{n}$ is free of rank $(m-1)(n-1)$ fo...
متن کاملTotally magic cordial labeling of some graphs
A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2000
ISSN: 0196-8858
DOI: 10.1006/aama.1999.0677